SPFD-Based Flexible Transformation of LUT-Based FPGA Circuits

نویسندگان

  • Katsunori Tanaka
  • Shigeru Yamashita
  • Yahiko Kambayashi
چکیده

In this paper, we present the condition for the effective wire addition in Look-Up-Table-based (LUT-based) field programmable gate array (FPGA) circuits, and an optimization procedure utilizing the effective wire addition. Each wire has different characteristics, such as delay and power dissipation. Therefore, the replacement of one critical wire for the circuit performance with many non-critical ones, i.e., many-additionfor-one-removal (m-for-1) is sufficiently useful. However, the conventional logic optimization methods based on sets of pairs of functions to be distinguished (SPFDs) for LUT-based FPGA circuits do not make use of the m-for-1 manipulation, and perform only simple replacement and removal, i.e., the one-addition-for-one-removal (1-for-1) manipulation and the noaddition-for-one-removal (0-for-1) manipulation, respectively. Since each LUT can realize an arbitrary internal function with respect to a specified number of input variables, there is no sufficient condition at the logic design level for simple wire addition. Moreover, in general, simple addition of a wire has no effects for removal of another wire, and it is important to derive the condition for non-simple and effective wire addition. We found the SPFD-based condition that wire addition is likely to make another wire redundant or replaceable, and developed an optimization procedure utilizing this effective wire addition. According to the experimental results, when we focused on the delay reduction of LUT-based FPGA circuits, our method reduced the delay by 24.2% from the initial circuits, while the conventional SPFD-based logic optimization and the enhanced global rewiring reduced it by 14.2% and 18.0%, respectively. Thus, our method presented in this paper is sufficiently practical, and is expected to improve the circuit performance. key words: logic design, set of pairs of functions to be distinguished (SPFD), look-up-table-based (LUT-based) field programmable gate array (FPGA), SPFD-based effective wire addition

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Power-Aware, Depth-Optimum and Area Minimization Mapping of K- LUT Based FPGA Circuits

This paper introduces an efficient application intended for mapping under complex criteria applied to K-LUT based FPGA implemented circuits. This application is based on an algorithm that was developed taking into consideration a significant design factor power consumption. Power consumption is considered in addition to other design factors that are traditionally used. To increase performance, ...

متن کامل

Enhanced SPFD Rewiring on Improving Rewiring Ability

This paper presents an in-depth study of the theory and algorithms for the SPFD-based (Set of Pairs of Functions to be Distinguished) rewiring, and explores the flexibility in the SPFD computation. Our contributions are in the following two areas: (1) We present a theorem and a related algorithm for more precise characterization of feasible SPFD-based rewiring. Extensive experimental results sh...

متن کامل

An Architecture Independent Packing Method for LUT-based Commercial FPGA

This paper proposes an efficient architecture independent packing method for commercial FPGA. All specific logics of commercial FPGA such as carry chain arithmetic, x-LUT, are pre-designed into reference circuits according to its architecture. Due to complex architecture of contemporary FPGA, to enumerate all reference circuits in a fine-grain manner is impractical. To overcome this problem, co...

متن کامل

On K-LUT Based FPGA Optimum Delay and Optimal Area Mapping

We developed, using structures from MV-SIS, an application dedicated to K-LUT based FPGA synthesis, named Xsynth. Main component of it, levelMap the mapping program, was implemented using the minDepth algorithm. The mapping program was instrumented in order to study and evaluate different heuristics involved in establishing best approach to find optimum delay and optimal area mapping. We did ru...

متن کامل

Heuristic Performance Optimal and Power Conscious for K-LUT Based FPGA Technology Mapping

In this paper is presented a new approach for decreasing the power consumption in LUT based FPGA implemented circuits. The attempt is based on reducing logic activity among LUTs. In order to achieve this target it was used the probability approach that estimates the dynamic logic activity of each line in the circuit. Traversing circuits from primary inputs lines to the primary output lines, ste...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEICE Transactions

دوره 88-A  شماره 

صفحات  -

تاریخ انتشار 2005